Time-Efficient Allocation Mechanisms for Crowdsensing Tasks with Precedence Constraints
نویسندگان
چکیده
منابع مشابه
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provides more features and capabilities than existing algorithms that schedule only independent tasks in real-time homogeneous systems. In addition, the proposed algorithm takes the heterogeneities of computation, communica...
متن کاملScheduling tasks with AND/OR precedence constraints
In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. These tasks are known as OR tasks. We analyze the complexity of two types of real-time AND/OR task scheduling problems. In the rst type of problem, al...
متن کاملLayer-Based Scheduling Algorithms for Multiprocessor-Tasks with Precedence Constraints
c © 2007 by John von Neumann Institute for Computing Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise requires prior specific permission by the publisher ment...
متن کاملTimed Input/Output Determinacy for Tasks with Precedence Constraints
We define a timing language that supports the design and implementation of embedded control software. The language is inspired by the Logical Execution Time (LET) paradigm of Giotto, but combines it with classical precedence constraints on tasks. A program specifies multiple modes of operation, where each mode consists of a set of periodically activated sensors, actuators, tasks, and mode switc...
متن کاملWinner determination for combinatorial auctions for tasks with time and precedence constraints
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for auctioning tasks that have time and precedence constraints. We use Expected Utility Theory as the basic mechanism for decision-making. Our theoretical and experimental analysis shows that Expected Utility is useful for c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sensors
سال: 2019
ISSN: 1424-8220
DOI: 10.3390/s19112456